linear number造句
例句與造句
- According to a strengthening of the theorem, every point set has at least a linear number of ordinary lines.
- Note that the resulting graph has a linear number of edges because a WSPD has a linear number of pairs.
- Note that the resulting graph has a linear number of edges because a WSPD has a linear number of pairs.
- However it has been shown that on the average for large point sets it has a linear number of connected components.
- Fast algorithms include the WSPD spanner and the Theta graph which both construct spanners with a linear number of edges in O ( n \ log n ) time.
- It's difficult to find linear number in a sentence. 用linear number造句挺難的
- However, without the loss of information the linear number of detector pixels fixes the energy spread needed in the beam which becomes increasingly difficult to control at higher energies.
- In fact, we don't have to check that all subsets of points are preferentially-independent; it is sufficient to check a linear number of pairs of commodities.
- Therefore, testing whether a schedule admits a solution with the optimal number of breaks can be done by solving a linear number of 2-satisfiability problems, one for each choice of the breakless team.
- However, for dense graphs ( more specifically, graphs in which each vertex has a linear number of neighbors ), the number of strong orientations may be estimated by a fully polynomial-time randomized approximation scheme.
- The resulting graph has only a linear number of edges and can be constructed in O ( " n " log " n " ) using a divide-and-conquer method or a sweepline algorithm.
- For instance, it implies that the majority function can be computed by a family of branching programs of constant width and polynomial size, while intuition might suggest that to achieve polynomial size, one needs a linear number of states.
- When the graph is represented using adjacency lists or an adjacency matrix, a single edge contraction operation can be implemented with a linear number of updates to the data structure, for a total running time of O ( | V | ^ 2 ).
- The construction requires that each computation step in M'corresponds to at least 2 computation steps of M . So M'takes no more than f ( " n " ) / 2 steps, after an initial linear number of steps to convert the input tape into the compressed representation.
- The crux is that there are many ( exponentially many ) more " deep " nodes than there are " shallow " nodes in a heap, so that siftUp may have its full logarithmic running-time on the approximately linear number of calls made on the nodes at or near the " bottom " of the heap.
- :: : Or rather, it's easy to prove that there exists a constant c as above : in any tree, find a maximal set of three-vertex paths; if b is bounded there must be a linear number of paths and each such path can only have seven out of eight possible states.
更多例句: 下一頁